Linkk Oping Electronic Articles in Batched Range Searching on a Mesh-connected Simd Computer Linkk Oping Electronic Articles in Computer and Information Science

نویسنده

  • Erik Sandewall
چکیده

Given a set of n points and hyperrectangles in d dimensional space the batched range searching problem is to determine which points each hyperrectangle contains We present two parallel algorithms for this problem on a p n pn mesh connected paral lel computer one average case e cient algorithm based on cell division and one worst case e cient divide and conquer algo rithm Besides the asymptotic analysis of their running times we present an experimental evaluation of the algorithms

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linkk Oping Electronic Articles in the Event Calculus in Classical Logic { Alternative Axiomatisations Linkk Oping Electronic Articles in Computer and Information Science

We present several alternative classical logic axiomatisations of the Event Calculus, a narrative based formalism for reasoning about actions and change. We indicate the range of applicability and key characteristics of each alternative formulation. 1

متن کامل

Linkk Oping Electronic Articles in Action Languages Linkk Oping Electronic Articles in Computer and Information Science

Action languages are formal models of parts of the natural lan guage that are used for talking about the e ects of actions This article is a collection of de nitions related to action languages that may be useful as a reference in future publications

متن کامل

Linkk Oping Electronic Articles in This Work Has Beensubmitted for Publication Elsewhere. Parallel Algorithms for Searching Monotone Matrices on Coarse Grained Multicomputers Linkk Oping Electronic Articles in Computer and Information Science

We present parallel algorithms for geometric problems on coarse grained multicomputers More speci cally for a square mesh connected p processor computer we show that The implicit row maxima problem on a totally monotone n nmatrix can be solved in O n p log p time if n p The all farthest neighbors problem for a convex n gon can be solved in O n p p time if n p The maximum perimeter triangle insc...

متن کامل

Linkk Oping Electronic Articles in 1st Order Logic Formal Concept Analysis: from Logic Programming to Theory Linkk Oping Electronic Articles in Computer and Information Science

In this paper we analyze and de ne the introduction of st or der logic in Formal Concept Analysis FCA the aims are both theoretical as a complete model is needed and applied so as to improve expression power of FCA as a knowledge mining tool and the relevance of its results Our contribution consists in i the implementation of clas sical FCA in logic programming and the analysis of real cases ii...

متن کامل

Linkk Oping Electronic Articles in Relating Theories of Actions and Reactive Control Linkk Oping Electronic Articles in Computer and Information Science

In this paper we give a formal characterization of reactive control using action theories. In the process we formalize the notion of a reactive control program being correct with respect to a given goal, a set of initial states, and action theories about the agent/robot and about the exogenous actions. We give su ciency conditions that guarantee correctness and use it to give an automatic metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007